Model Checking Based on Kronecker Algebra
نویسنده
چکیده
Reachability analysis is a general approach to analyze Petri nets, but the state space explosion often permits its application. In the eld of performance analysis of stochastic Petri nets, modular representations of reachability graphs using Kronecker algebra have been successfully applied. This paper describes how a Kronecker representation of the reachability graph is employed for exploration of the reachability set and subsequent model checking of ordinary Petri nets and Computational Tree Logic. A new and space eecient representation of the reachability set is given. A non-trivial model of a production cell is exercised to demonstrate the usefulness of the approach. Extensions towards certain colored Petri nets are brieey sketched.
منابع مشابه
Lazy Parallel Kronecker Algebra-Operations on Heterogeneous Multicores
Kronecker algebra is a matrix calculus which allows the generation of thread interleavings from the source-code of a program. Thread interleavings have been shown effective for proving the absence of deadlocks. Because the number of interleavings grows exponentially in the number of threads, deadlock analysis is still a challenging problem. To make the computation of thread interleavings tracta...
متن کاملWhat a Structural World
Petri nets and stochastic Petri nets have been widely adopted as one of the best tools to model the logical and timing behavior of discrete-state systems. However, their practical applicability is limited by the state-space explosion problem. We survey some of the techniques that have been used to cope with large state spaces, starting from early explicit methods, which require data structures ...
متن کاملSymbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent probabilistic systems as models; these allow nondeterministic choice between probability distributions and are particularly well suited to modelling distributed systems with probabilistic behaviour, e.g. randomized c...
متن کاملOn Some Formulas in the Hall Algebra of the Kronecker Algebra
In [5] Pu Zhang presents a PBW-basis of the composition subalgebra of the Hall algebra in the Kronecker case. The construction is based on formulas expressing the product of some specific elements in the Hall algebra (see Theorem 4.2, 4.3 in [5]). Using a different approach we will reprove these formulas in an entirely independent manner.
متن کاملAdvances in compositional approaches based on Kronecker algebra: Application to the study of manufacturing systems
Recent developments in the use of Kronecker algebra for the solution of continuous-time Markov chains (CTMCs), in particular models based on stochastic Petri nets, have increased the size of the systems that can be analyzed using exact numerical methods. We report on the more recent results, and employ them to study a kanban system.
متن کامل